The affine-scaling direction for linear programming is a limit of projective-scaling directions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Affine-scaling Pivot Algorithm for Linear Programming

We proposed a pivot algorithm using the affine-scaling technique. It produces a sequence of interior points as well as a sequence of vertices, until reaching an optimal vertex. We report preliminary but favorable computational results obtained with a dense implementation of it on a set of standard Netlib test problems.

متن کامل

Affine scaling algorithm fails for semidefinite programming

In this paper, we introduce an aane scaling algorithm for semideenite programming, and give an example of a semideenite program such that the aane scaling algorithm converges to a non-optimal point. Both our program and its dual have interior feasible solutions, and unique optimal solutions which satisfy strict complementarity, and they are nondegenerate everywhere. Abbreviated Title: AAne scal...

متن کامل

On affine scaling and semi-infinite programming

In this note we are concerned with the generalization given by Ferris and Philpott [3] of the affine scaling algorithm discovered by Dikin [2] to solve semi-infinite linear programming problems, in which the number of variables is finite, but the number of constraints is not. In [3] a discrepancy is pointed out between the classical algorithm and its generalization. The purpose of this note is ...

متن کامل

Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

Copies of these reports may be obtained from the bureau of the Faculty of Technical Math-A selection of these reports is available in PostScript form at the Faculty's anonymous ftp-Abstract Primal{dual aane{scaling methods have recently been extended from linear programming to semideenite programming. We show how to analyse these methods in the framework of potential reduction algorithms. The a...

متن کامل

Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems

In this paper we present new global convergence results on a long-step affine scaling algorithm obtained by means of the local Karmarkar potential functions. This development was triggered by Dikin’s interesting result on the convergence of the dual estimates associated with a longstep affine scaling algorithm for homogeneous LP problems with unique optimal solutions. Without requiring any assu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1991

ISSN: 0024-3795

DOI: 10.1016/0024-3795(91)90268-2